Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and Solutions
نویسندگان
چکیده
منابع مشابه
Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and Solutions
Multi-robot task allocation is one of the main problems to address in order to design a multi-robot system, very especially when robots form coalitions that must carry out tasks before a deadline. A lot of factors affect the performance of these systems and among them, this paper is focused on the physical interference effect, produced when two or more robots want to access the same point simul...
متن کاملMulti-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; the three main ones being the package deal procedure in which all the issues are bundled and discussed together, the simultaneous procedure in which the issues are discussed simultaneously but independently of each oth...
متن کاملASyMTRe: Building Coalitions for Heterogeneous Multi-Robot Teams
This dissertation addresses the problem of synthesizing task solution strategies for a heterogeneous robot team to accomplish multi-robot tasks by sharing sensory and computational resources. The approach I developed is called ASyMTRe, which stands for Automated Synthesis of Multi-robot Task solutions through software Reconfiguration, pronounced “Asymmetry”. When dealing with heterogeneous team...
متن کاملDeadlines, Travel Time, and Robot Problem Solving
1 Abstract This paper describes some extensions to the reductionist planning paradigm typified by Sacerdoti's NOAH program. Certain inadequacies of the partial ordering scheme used in NOAH are pointed out and a new architecture is detailed which circumvents these problems. An example from the semi-automated factory domain is used to illustrate features of the new planner. Techniques for elimina...
متن کاملParallel multi-objective multi-robot coalition formation
Consider a system with M robots each having K resource types and N tasks having a vector of Kresource types. A coalition scheme represents a grouping of a given set of robots into disjoint subsets where each subset (coalition ) is assigned one task. Thus for N tasks we have N coalition schemes, represented as CS = {C1, C2,,....CN}, In this problem we have considered the following two conflictin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2017
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0170659